Descent of affine buildings - I. Large minimal angles
نویسندگان
چکیده
In this two-part paper we prove an existence result for affine buildings arising from exceptional algebraic reductive groups. Combined with earlier results on classical groups, this gives a complete and positive answer to the conjecture concerning the existence of affine buildings arising from such groups defined over a (skew) field with a complete valuation, as proposed by Jacques Tits. This first part lays the foundations for our approach and deals with the ‘large minimal angle’ case.
منابع مشابه
TORSION IN K-THEORY FOR BOUNDARY ACTIONS ON AFFINE BUILDINGS OF TYPE Ãn
Let Γ be a torsion free lattice in G = PGL(n+ 1,F), where n ≥ 1 and F is a non-archimedean local field. Then Γ acts on the Furstenberg boundary G/P , where P is a minimal parabolic subgroup of G. The identity element I in the crossed product C∗-algebra C(G/P ) ⋊ Γ generates a class [I] in the K0 group of C(G/P ) ⋊ Γ. It is shown that [I] is a torsion element of K0 and there is an explicit bound...
متن کاملAN OBSERVER-BASED INTELLIGENT DECENTRALIZED VARIABLE STRUCTURE CONTROLLER FOR NONLINEAR NON-CANONICAL NON-AFFINE LARGE SCALE SYSTEMS
In this paper, an observer based fuzzy adaptive controller (FAC) is designed fora class of large scale systems with non-canonical non-affine nonlinear subsystems. It isassumed that functions of the subsystems and the interactions among subsystems areunknown. By constructing a new class of state observer for each follower, the proposedconsensus control method solves the problem of unmeasured sta...
متن کاملDecentralized Adaptive Control of Large-Scale Non-affine Nonlinear Time-Delay Systems Using Neural Networks
In this paper, a decentralized adaptive neural controller is proposed for a class of large-scale nonlinear systems with unknown nonlinear, non-affine subsystems and unknown nonlinear time-delay interconnections. The stability of the closed loop system is guaranteed through Lyapunov-Krasovskii stability analysis. Simulation results are provided to show the effectiveness of the proposed approache...
متن کاملOptimal Approximation with Sparsely Connected Deep Neural Networks
We derive fundamental lower bounds on the connectivity and the memory requirements of deep neural networks guaranteeing uniform approximation rates for arbitrary function classes inL2(Rd). In other words, we establish a connection between the complexity of a function class and the complexity of deep neural networks approximating functions from this class to within a prescribed accuracy. Additio...
متن کامل